Search results for " matching"
showing 10 items of 312 documents
Text Compression Using Antidictionaries
1999
International audience; We give a new text compression scheme based on Forbidden Words ("antidictionary"). We prove that our algorithms attain the entropy for balanced binary sources. They run in linear time. Moreover, one of the main advantages of this approach is that it produces very fast decompressors. A second advantage is a synchronization property that is helpful to search compressed data and allows parallel compression. Our algorithms can also be presented as "compilers" that create compressors dedicated to any previously fixed source. The techniques used in this paper are from Information Theory and Finite Automata.
Binary jumbled string matching for highly run-length compressible texts
2012
The Binary Jumbled String Matching problem is defined as: Given a string $s$ over $\{a,b\}$ of length $n$ and a query $(x,y)$, with $x,y$ non-negative integers, decide whether $s$ has a substring $t$ with exactly $x$ $a$'s and $y$ $b$'s. Previous solutions created an index of size O(n) in a pre-processing step, which was then used to answer queries in constant time. The fastest algorithms for construction of this index have running time $O(n^2/\log n)$ [Burcsi et al., FUN 2010; Moosa and Rahman, IPL 2010], or $O(n^2/\log^2 n)$ in the word-RAM model [Moosa and Rahman, JDA 2012]. We propose an index constructed directly from the run-length encoding of $s$. The construction time of our index i…
Transarterial chemoembolization versus sorafenib in patients with hepatocellular carcinoma and extrahepatic disease
2017
BackgroundSorafenib is the recommended treatment for advanced hepatocellular carcinoma (HCC), but transarterial chemoembolization (TACE) is performed in individual cases with limited extrahepatic spread. The aim of this study was to compare the outcome of patients with HCC and extrahepatic disease (EHD) treated with sorafenib and TACE.MethodsA total of 172 patients with HCC and EHD treated with sorafenib (n = 98) or TACE (n = 74) at three German referral centers (Hannover, Mainz and Hamburg) were included in this study. In order to reduce selection bias, patients were matched for significant demographic differences using a propensity score analysis.ResultsPatients with liver cirrhosis, high…
Re-examining the migration–trade link using province data: An application of the generalized propensity score
2013
Abstract The migration–trade link has been studied extensively since the mid nineties, finding a positive impact through different channels. Based on the generalized propensity score (GPS) methodology, we estimate a dose–response function, depicting a non-linear impact of immigration on exports using province data for Spain and Italy. For both countries the response of province exports to more immigrants from a given nationality is always positive, although varies with the level of immigrants. First we find neither minimum threshold nor exhaustion point in the effectiveness of the immigration networks on province exports. Second we find that the value of the potential bilateral exports reac…
1-Year Outcomes of Everolimus-Eluting Bioresorbable Scaffolds Versus Everolimus-Eluting Stents
2016
Abstract Objectives The purpose of this study was to compare the 1-year outcomes of the ABSORB everolimus-eluting bioresorbable scaffold (BRS) (Abbott Vascular, Santa Clara, California) and the XIENCE everolimus-eluting stent (EES) (Abbott Vascular) in patients undergoing percutaneous coronary intervention. Background Randomized studies of the ABSORB BRS have been performed in selected patient and lesion scenarios. The available registries of the ABSORB BRS reflect real-world practice more closely compared with randomized studies, but most of them are limited by the small sample size and the lack of comparative outcomes versus second-generation drug-eluting stents. Methods A total of 1,189 …
Bit-Parallel Approximate Pattern Matching on the Xeon Phi Coprocessor
2014
Bit-parallel pattern matching encodes calculated values in bit arrays. This approach gains its efficiency by performing multiple updates within a machine word. An important parameter is therefore the machine word size (e.g. 32 or 64 bits). With the increasing length of vector registers, the efficient mapping of bit-parallel pattern matching algorithms onto modern high performance computing architectures is becoming increasingly important. In this paper, we investigate an efficient implementation of the Wu-Manber approximate pattern matching algorithm on the Intel Xeon Phi coprocessor. This architecture features a 512-bit long vector processing unit (VPU) as well as a large number of process…
Ceftazidime-avibactam use for klebsiella pneumoniae carbapenemase-producing k. pneumoniae infections: A retrospective observational multicenter study
2021
Abstract Background A growing body of observational evidence supports the value of ceftazidime-avibactam (CAZ-AVI) in managing infections caused by carbapenem-resistant Enterobacteriaceae. Methods We retrospectively analyzed observational data on use and outcomes of CAZ-AVI therapy for infections caused by Klebsiella pneumoniae carbapenemase–producing K. pneumoniae (KPC-Kp) strains. Multivariate regression analysis was used to identify variables independently associated with 30-day mortality. Results were adjusted for propensity score for receipt of CAZ-AVI combination regimens versus CAZ-AVI monotherapy. Results The cohort comprised 577 adults with bloodstream infections (n = 391) or nonba…
Ontology-based state representations for intention recognition in human–robot collaborative environments
2013
In this paper, we describe a novel approach for representing state information for the purpose of intention recognition in cooperative human-robot environments. States are represented by a combination of spatial relationships in a Cartesian frame along with cardinal direction information. This approach is applied to a manufacturing kitting operation, where humans and robots are working together to develop kits. Based upon a set of predefined high-level state relationships that must be true for future actions to occur, a robot can use the detailed state information described in this paper to infer the probability of subsequent actions occurring. This would allow the robot to better help the …
Detecting multiple copies in tampered images
2010
Copy-move forgeries are parts of the image that are duplicated elsewhere into the same image, often after being modified by geometrical transformations. In this paper we present a method to detect these image alterations, using a SIFT-based approach. First we describe a state of the art SIFT-point matching method, which inspired our algorithm, then we compare it with our SIFT-based approach, which consists of three parts: keypoint clustering, cluster matching, and texture analysis. The goal is to find copies of the same object, i.e. clusters of points, rather than points that match. Cluster matching proves to give better results than single point matching, since it returns a complete and co…
The time course of face matching for featural and relational image manipulations
2011
It was found recently that horizontal and vertical relationships of facial features are differently vulnerable to inversion (Goffaux & Rossion, 2007). When faces are upside down manipulations of vertical relations are difficult to detect, while only moderate performance deficits are found for manipulations of horizontal relations, or when features differ. We replicate the findings of Goffaux and Rossion, and record the temporal courses of face matching performance and the effects of inversion. For vertical relations and featural changes inversion effects arise immediately, starting with the first 50 ms of processing. For horizontal relations inversion effects are absent at brief timings, bu…